Sink or swim together: necessary and sufficient conditions for finite moments of workload components in FIFO multiserver queues

نویسندگان

  • Alan Scheller-Wolf
  • Rein Vesilo
چکیده

Previously established necessary and sufficient conditions for finite stationary moments in stable FIFO GI/GI/s queues exist only for the first component of the workload vector, the delay. In this paper, we derive moment results for all the components of the stationary workload vector in stable FIFO GI/GI/s queues. As in the case of stationary delay, the moment conditions for workload components incorporate the interaction between service time distribution, traffic intensity and the number of servers in the queue. If we denote a generic service time random variable by S, a generic interarrival time by T , and define the traffic intensity as ρ = ES/ET , then sufficient conditions so that EWi < ∞, where Wi is the i’th smallest component of the ordered workload vector, depend crucially on the traffic intensity relative to i — specifically, on whether i ≤ dρe or i > dρe, where for any real x, dxe denotes the smallest interger greater than or equal to x. Explicitly, for i ≤ dρe, EW i < ∞, provided that ES1 < ∞, where β1(i) = (s− bρc+ α)/(s− bρc), for α ≥ 1. Furthermore, components with indices lower than dρe all share the same finite moment conditions. This is not true for i > dρe; these components have individual finite moment conditions: EW i < ∞ provided that ES2 < ∞, where β2(i) = (s − i+ α)/(s − i), for α ≥ 1. Finally, for S in the class L βj(i) 1 , j = 1, 2, defined in [9], these conditions are also necessary.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite Moments of Workload Components in FIFO Multiserver Queues

Previously established necessary and sufficient conditions for finite stationary moments in stable FIFO GI/GI/s queues exist only for the first component of the workload vector, the delay. In this paper, we derive moment results for all the components of the stationary workload vector in stable FIFO GI/GI/s queues. As in the case of stationary delay, the moment conditions for workload component...

متن کامل

Further delay moment results for FIFO multiserver queues

Using a new family of service disciplines, we provide weaker su cient conditions for nite stationary delay moments in FIFO multiserver queues. This extends the work in Sigman and Scheller-Wolf[1997] to GI=GI=s queues with = E[S]=E[T ] < s 1, where S and T are generic service and interarrival times, respectively. Thus, only when > s 1 are the familiar Kie er and Wolfowitz conditions actually nec...

متن کامل

Performance, Scalability, and Semantics of Concurrent FIFO Queues

We introduce the notion of a k-FIFO queue which may dequeue elements out of FIFO order up to a constant k ≥ 0. Retrieving the oldest element from the queue may require up to k+ 1 dequeue operations (bounded fairness), which may return elements not younger than the k + 1 oldest elements in the queue (bounded age) or nothing even if there are elements in the queue. A k-FIFO queue is starvation-fr...

متن کامل

Markovian Retrial Queues with Two Way Communication

In this paper, we first consider single server retrial queues with two way communication. Ingoing calls arrive at the server according to a Poisson process. Service times of these calls follow an exponential distribution. If the server is idle, it starts making an outgoing call in an exponentially distributed time. The duration of outgoing calls follows another exponential distribution. An ingo...

متن کامل

Longest Path in Networks of Queues in the Steady-State

Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Queueing Syst.

دوره 67  شماره 

صفحات  -

تاریخ انتشار 2011